PUF-PRFs: A New Tamper-resilient Cryptographic Primitive
نویسندگان
چکیده
With the proliferation of physical attacks that may compromise even the theoretically strongest cryptographic schemes, the need for affordable physical protection of cryptographic devices becomes more visible by each day. In this context, Physically Unclonable Functions (PUFs), a promising new technology, provide a low cost technique to realize tamper-resilient storage for secret keys in integrated circuits (ICs). However, PUFs possess some unusual properties that set them apart from ordinary hardware components: their responses are noisy and tend to change when PUFs are manipulated through external influences. These properties have limited the applications of PUFs so far to only physically protecting stored key material. This raises the question as to what extent PUFs can be used to construct other cryptographic schemes. In this paper, we take the first step towards answering this question and place PUFs in the core of a pseudorandom function (PRF) construction. PRFs are one of the most important cryptographic primitives used to design various cryptographic schemes such as stream or block ciphers. We first give a theoretical model for PUFs and justify it by real-life PUF-implementations. Then, we show how to use PUFs to construct tamper-resilient PRFs, termed as PUF-PRFs. However, for several reasons that we outline in this work, PUF-PRFs cannot directly replace PRFs. Nevertheless, we show that PUF-PRFs represent a new cryptographic primitive with very useful properties: they are inherently resilient to tampering attacks and allow for generating (almost) uniformly distributed values.
منابع مشابه
PUF-HB: A Tamper-Resilient HB Based Authentication Protocol
We propose a light-weight protocol for authentication of low-power devices. Our construc-tion PUF-HB merges the positive qualities of two families of authentication functions. PUFrepresents physically unclonable functions and fulfills the purpose of providing low-cost tamper-resilient challenge-response authentication. On the other hand, the Hopper Blum (HB) functionprovides...
متن کاملWatermarking Cryptographic Functionalities from Standard Lattice Assumptions
A software watermarking scheme allows one to embed a “mark” into a program without significantly altering the behavior of the program. Moreover, it should be difficult to remove the watermark without destroying the functionality of the program. Recently, Cohen et al. (STOC 2016) and Boneh et al. (PKC 2017) showed how to watermark cryptographic functions such as PRFs using indistinguishability o...
متن کاملA new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملMultilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security
Since its introduction, pseudorandom functions (PRFs) have become one of the main building blocks of cryptographic protocols. In this work, we revisit two recent extensions of standard PRFs, namely multilinear and aggregate PRFs, and provide several new results for these primitives. In the case of aggregate PRFs, one of our main results is a proof of security for the Naor-Reingold PRF with resp...
متن کاملHow to Avoid Obfuscation Using Witness PRFs
We propose a new cryptographic primitive called witness pseudorandom functions (witness PRFs). Witness PRFs are related to witness encryption, but appear strictly stronger: we show that witness PRFs can be used for applications such as multi-party key exchange without trsuted setup, polynomially-many hardcore bits for any one-way function, and several others that were previously only possible u...
متن کامل